Lower bound technique for length-reducing automata
نویسندگان
چکیده
منابع مشابه
Lower bound technique for length-reducing automata
The class of growing context-sensitive languages (GCSL) was proposed as a naturally defined subclass of contextsensitive languages whose membership problem is solvable in polynomial time. Growing context-sensitive languages and their deterministic counterpart calledChurch–Rosser languages (CRL) complement theChomskyhierarchy in a naturalway, as the classes filling the gap between context-free l...
متن کاملA Lower Bound For Reversible Automata
A réversible automaton is a finite automaton in which each letter induces a partial one-to-one map from the set of states into itself. We solve the following problem proposed by Pin. Given an alphabet A, does there exist a séquence of languages Kn on A which can be accepted by a réversible automaton, and such that the number of states of the minimal automaton of Kn is in O(n), while the minimal...
متن کاملA Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability μ of the target machine, besides the number of states and the usual accuracy and confidence parameters. We show that the dependence on μ is necessary for every algorithm whose structure resembles existing ones. As a technical tool, a new variant of Statistical Queries termed L∞-que...
متن کاملA Tight Lower Bound for the Complementation of Rabin Automata
Complementing ω-automata is a crucial instrument for solving the ω-language containment problem, and therefore it has numerous applications in formal language theory, program analysis and modelchecking. There have been great interests in determining the exact complexity of the complementation problem. However, obtaining nontrivial lower bounds for the complementation problem has been difficult....
متن کاملDecision Problems for Lower/Upper Bound Parametric Timed Automata
We investigate a class of parametric timed automata, called lower bound/upper bound (L/U) automata, where each parameter occurs in the timing constraints either as a lower bound or as an upper bound. For such automata, we show that basic decision problems, such as emptiness, finiteness and universality of the set of parameter valuations for which there is a corresponding infinite accepting run ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.02.003